翻訳と辞書 |
Quotient graph : ウィキペディア英語版 | Quotient graph In graph theory, a quotient graph ''Q'' of a graph ''G'' is a graph whose vertices are blocks of a partition of the vertices of ''G'' and where block ''B'' is adjacent to block ''C'' if some vertex in ''B'' is adjacent to some vertex in ''C'' with respect to the edge set of ''G''.〔.〕 In other words, if ''G'' has edge set ''E'' and vertex set ''V'' and ''R'' is the equivalence relation induced by the partition, then the quotient graph has vertex set ''V''/''R'' and edge set . For example, the condensation of a strongly connected graph is the quotient graph where the strongly connected components form the blocks of the partition.〔.〕 ==References==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Quotient graph」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|